Obling: a Tester for Transformational Grammars
نویسندگان
چکیده
Transformational grammars have developed with recent research in linguistics. They appear to be a powerful and explicit device for characterizing the description of sentences; they also meet conditions of adequacy that can be applied to check that a sentence, or a set of rules, is well-formed. A transformational grammar tester is part of a strategy for the selection of a well-formed grammar matching the data base. To put it more explicitly, a tester of this sort should provide the linguist a class of the possible grammars which concerns precisely the linguistic theory. These grammars have the form given by CUOMSKY in Aspects (see bibliograIShy).
منابع مشابه
On Restrictions on Transformational Grammars Reducing the Generative Power
Various restrictions on transformational grammars have been investigated in order to reduce their generative power from recursively enumerable languages to recursive languages. It will be shown that any restriction on transformational grammars defining a recursively enumerable subset of the set of all transformational grammars, is either too weak (in the sense that there does not exist a genera...
متن کاملOn the Generative Power of
Mathematical modeling of phrase structure grammars has yielded many results of benefit to linguists in their investigation of these grammars, such as Chomsky’s characterization in terms of self-embedding of those context-free languages which are not regular. The recent shift of focus in linguistic theory to transformational grammars has not been accompanied by a similar application of mathemati...
متن کاملExploiting auxiliary distributions in stochastic uni
This paper describes a method for estimating conditional probability distributions over the parses of uniication-basedd grammars which can utilize auxiliary distributions that are estimated by other means. We show how this can be used to incorporate information about lexical selectional preferences gathered from other sources into Stochastic Uniication-basedd Grammars (SUBGs). While we apply th...
متن کاملComputational Complexity and Lexical Funtional Grammar
An important goal of modern linguistic theory is to characterize as narrowly as possible the class of natural languages. One classical approach to this characterization has been to investigate the generative capacity of grammatical systems specifiable within particular linguistic theories. Formal results along these lines have already been obtained for certain kinds of Transformational Generat ...
متن کامل